Hubert Comon - Lundh Florent Jacquemard Nicolas Perrin Tree Automata with Memory , Visibility
نویسندگان
چکیده
Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison. Though it has a decidable emptiness problem, the main weakness of this model is its lack of good closure properties. We propose a generalization of the visibly pushdown automata of Alur and Madhusudan to a family of tree recognizers which carry along their (bottom-up) computation an auxiliary unbounded memory with a tree structure (instead of a symbol stack). In other words, these recognizers, called visibly Tree Automata with Memory (VTAM) define a subclass of tree automata with one memory enjoying Boolean closure properties. We show in particular that they can be determinized and the problems like emptiness, inclusion and universality are decidable for VTAM. Moreover, we propose an extension of VTAM whose transitions may be constrained by structural equality and disequality tests between memories, and show that this extension preserves the good closure and decidability properties.
منابع مشابه
Tree Automata with Memory, Visibility and Structural Constraints
Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison. Though it has a decidable emptiness problem, the main weakness of this model is its lack of good closure properties. We propose a generalization of the visibly pushdown automata of Alur and Madhusudan ...
متن کاملVisibly Tree Automata with Memory and Constraints
Tree automata with one memory have been introduced in 2001. They generalize both pushdown (word) automata and the tree automata with constraints of equality between brothers of Bogaert and Tison. Though it has a decidable emptiness problem, the main weakness of this model is its lack of good closure properties. We propose a generalization of the visibly pushdown automata of Alur and Madhusudan ...
متن کاملGround Reducibility and Automata with Disequality Constraints
Using the automata with constraints, we give an algorithm for the decision of ground reducibility of a term t w.r.t. a rewriting system R. The complexity of the algorithm is doubly exponential in the maximum of the depths of t and R and the cardinal of R.
متن کاملPumping, Cleaning and Symbolic Constraints Solving
We deene a new class of tree automata which generalizes both the encompassment au-tomata of 3] and the automata with tests between brothers of 2]. We give a pumping lemma for these automata, which implies that the emptiness of the corresponding language is de-cidable. Then, we show how to decide emptiness by means of a "cleaning" algorithm, which leads to more eeective decision procedures.
متن کامل